q-log-convexity from linear transformations and polynomials with only real zeros
نویسندگان
چکیده
منابع مشابه
Linear Transformations Preserving the Strong $q$-log-convexity of Polynomials
In this paper, we give a sufficient condition for the linear transformation preserving the strong q-log-convexity. As applications, we get some linear transformations (for instance, Morgan-Voyce transformation, binomial transformation, Narayana transformations of two kinds) preserving the strong q-log-convexity. In addition, our results not only extend some known results, but also imply the str...
متن کاملq-Eulerian Polynomials and Polynomials with Only Real Zeros
Let f and F be two polynomials satisfying F (x) = u(x)f(x) + v(x)f (x). We characterize the relation between the location and multiplicity of the real zeros of f and F , which generalizes and unifies many known results, including the results of Brenti and Brändén about the q-Eulerian polynomials.
متن کاملPolynomials with only real zeros 1
Conditions which ensure that a combination of real polynomials, which have real interlacing zeros, continues to have only real zeros are derived. This gives a generalization of a result of Haglund and is proved using a unified method of Liu-Wang-Yeh.
متن کاملTheorems and Conjectures Involving Rook Polynomials with Only Real Zeros
Let A = (aij) be a real n n matrix with non-negative entries which are weakly increasing down columns. If B = (bij) is the n n matrix where bij := aij+z; then we conjecture that all of the roots of the permanent of B, as a polynomial in z; are real. Here we establish several special cases of the conjecture.
متن کاملFurther Investigations Involving Rook Polynomials With Only Real Zeros
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by Chung and Graham [ChGr]. Another involves a version of the \hit polynomial" of rook theory, but which applies to weighted matchings in (non-bipartite) graphs. For both of these families we prove a result which is anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2018
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2018.06.003